Isomorphisms of Infinite Steiner Triple Systems
نویسنده
چکیده
An infinite countable Steiner triple system is called universal if any countable Steiner triple system can be embedded into it. The main result of this paper is the proof of non-existence of a universal Steiner triple system. The fact is proven by constructing a family S of size 2 of infinite countable Steiner triple systems so that no finite Steiner triple system can be embedded into any of the systems from S and no infinite countable Steiner triple system can be embedded into any two of the systems from S (it follows that the systems from S are pairwise non-isomorphic). A Steiner triple system is called rigid if the only automorphism it admits is the trivial one the identity. An additional result presented in this paper is a construction of a family of size 2 of pairwise non-isomorphic infinite countable rigid Steiner triple systems.
منابع مشابه
Isomorphisms of Infinite Steiner Triple Systems II
A combinatorial method in conjuction with the results presented in [F] is introduced to prove that for any infinite cardinal κ, and every cardinal λ, 0≤λ≤κ, there are 2 mutually non-isomorphic Steiner triple systems of size κ that admit exactly 2 automorphisms. In particular, there are 2 mutually non-isomorphic rigid Steiner triple systems of size κ.
متن کاملPerfect countably infinite Steiner triple systems
We use a free construction to prove the existence of perfect Steiner triple systems on a countably infinite point set. We use a specific countably infinite family of partial Steiner triple systems to start the construction, thus yielding 2א0 non-isomorphic perfect systems.
متن کاملIdentical twin Steiner triple systems
Two Steiner triple systems, each containing precisely one Pasch configuration which, when traded, switches one system to the other, are called twin Steiner triple systems. If the two systems are isomorphic the systems are called identical twins. Hitherto, identical twins were only known for orders 21, 27 and 33. In this paper we construct infinite families of identical twin Steiner triple systems.
متن کاملAn infinite family of Steiner systems S(2, 4, 2m) from cyclic codes
Steiner systems are a fascinating topic of combinatorics. The most studied Steiner systems are S(2,3,v) (Steiner triple systems), S(3,4,v) (Steiner quadruple systems), and S(2,4,v). There are a few infinite families of Steiner systems S(2,4,v) in the literature. The objective of this paper is to present an infinite family of Steiner systems S(2,4,2m) for all m ≡ 2 (mod 4)≥ 6 from cyclic codes. ...
متن کاملOn 6-sparse Steiner triple systems
We give the first known examples of 6-sparse Steiner triple systems by constructing 29 such systems in the residue class 7 modulo 12, with orders ranging from 139 to 4447. We then present a recursive construction which establishes the existence of 6-sparse systems for an infinite set of orders. Observations are also made concerning existing construction methods for perfect Steiner triple system...
متن کامل